Programming a hypercube multicomputer

Clustering on a Hypercube Multicomputer

In this paper, squared error clustering algorithms for SIMD hypercubes are presented. These algorithms are asymptotically faster than previously known algorithms and require lesser amount of memory per PE. For a clustering problem with .V patterns, M features per pattern and I< clusters, our algorithms complete in O(k + logd%-dI) steps on S-ZI processor hypercubes. This is optimal up to a const...

String Editing on an SIMD Hypercube Multicomputer

SIMD hypercube algorithms to determine a minimum cost edit sequence to transform one string into another are developed. If the two strings are of length n, our algorithms take O √ p nlogn ______ + log2n time when n2p, 1 ≤ p ≤ n, processors are available. When p2 , nlogn ≤ p2 < n2 processors are available, the complexity of our algorithm is O p n1.5 ____ √ logn .

Mapping Modular, Hierarchical Discrete Event Models in a Hypercube Multicomputer

Multicomputer Object Stores: The Multicomputer Texas Experiment

The paper is about design of object stores for distributed memory computers. Problems of distribution within such stores areThis paper appeared in the proceedings of the Seventh International Workshop on Persistent Object Systems described through the design of Multicomputer Texas, a system derived from the Texas store [8] and implemented on a scalable multicomputer (a Fujitsu AP1000). Problems...

Multicast Communication in Multicomputer Networks Multicast Communication in Multicomputer Networks

EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. While multicast communication is highly demanded in many applications, it is not directly supported by all existing multicom-puters; rather it is indirectly supported by multiple one-to-on...